Efficient verification of performability guarantees

نویسندگان

  • Guillermo A. Alvarez
  • Mustafa Uysal
  • Arif Merchant
چکیده

The performability of a system is usually evaluated as the mean of a performance measure, aggregated over all failure scenarios (both tolerated and not) through a Markov reward process. This metric can gloss over performance deficiencies in important portions of the failure scenario space, and is also expensive to compute because the number of possible failure scenarios can be very large. We argue that a multi-part performability specification better represents the requirements of system designers and present a fast algorithm for determining whether a given system meets such specifications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performability Evaluation Low-Powered Sensor Node by Stochastic Model Checking

Wireless Sensor Network (WSN) applications, there may be many low-powered sensor nodes which can communicate with each other by wireless techniques. Due to limited power supply, the satisfiability of performability properties, which include energy constraints especially, must be confirmed in design phase. This will help one to avoid implementing impracticable designs. A typical performability p...

متن کامل

Performability analysis of guarded-operation duration: a translation approach for reward model solutions

Performability measures are often defined for analyzing the worth of fault-tolerant systems whose performance is gracefully degradable. Accordingly, performability evaluation is inherently well-suited for application of reward model solution techniques. On the other hand, the complexity of performability evaluation for solving engineering problems may prevent us from utilizing those techniques ...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

Numerical evaluation of a group-oriented multicast protocol using stochastic activity networks

Group-oriented multicast protocols that provide message ordering and delivery guarantees are becoming increasingly important in distributed system design. However, despite the large number of such protocols, little analytical work has been done concerning their performance, especially in the presence of message loss. This paper illustrates a method for determining the performability of group-or...

متن کامل

A Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing

Correctness verification of query results is a significant challenge in database outsourcing. Most of the proposed approaches impose high overhead, which makes them impractical in real scenarios. Probabilistic approaches are proposed in order to reduce the computation overhead pertaining to the verification process. In this paper, we use the notion of trust as the basis of our probabilistic app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001